Generating Optimal Eighth Order Methods for Computing Multiple Roots
نویسندگان
چکیده
منابع مشابه
Three-step iterative methods with optimal eighth-order convergence
In this paper, based on Ostrowski’s method, a new family of eighth-order methods for solving nonlinear equations is derived. In terms of computational cost, each iteration of these methods requires three evaluations of the function and one evaluation of its first derivative, so that their efficiency indices are 1.682, which is optimal according to Kung and Traub’s conjecture. Numerical comparis...
متن کاملTHIRD-ORDER AND FOURTH-ORDER ITERATIVE METHODS FREE FROM SECOND DERIVATIVE FOR FINDING MULTIPLE ROOTS OF NONLINEAR EQUATIONS
In this paper, we present two new families of third-order and fourth-order methods for finding multiple roots of nonlinear equations. Each of them requires one evaluation of the function and two of its first derivative per iteration. Several numerical examples are given to illustrate the performance of the presented methods.
متن کاملCorrigendum to "Basins of attraction for optimal eighth-order methods to find simple roots of nonlinear equations"
Several optimal eighth order methods to obtain simple roots are analyzed. The methods are based on two step, fourth order optimal methods and a third step of modified Newton. The modification is performed by taking an interpolating polynomial to replace either f ðznÞ or f ðznÞ. In six of the eight methods we have used a Hermite interpolating polynomial. The other two schemes use inverse interpo...
متن کاملBasins of attraction for several optimal fourth order methods for multiple roots
There are very few optimal fourth order methods for solving nonlinear algebraic equations having roots of multiplicity m. Here we compare five such methods, two of which require the evaluation of the (m − 1)st root. The methods are usually compared by evaluating the computational efficiency and the efficiency index. In this paper all the methods have the same efficiency, since they are of the s...
متن کاملNew optimal class of higher-order methods for multiple roots, permitting f′(xn) = 0
Finding multiple zeros of nonlinear functions pose many difficulties for many of the iterative methods. A major difficulty in the application of iterative methods is the selection of initial guess such that neither guess is far from zero nor the derivative is small in the vicinity of the required root, otherwise the methods would fail miserably. Finding a criterion for choosing initial guess is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Symmetry
سال: 2020
ISSN: 2073-8994
DOI: 10.3390/sym12121947